#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    for(LL i=0;i<n+10;i++) a[i]=0;
    for(LL i=1;i<=n;i++) cin>>a[i];
    LL sum=0;
    for(LL i=1;i<n;i++){
        if(max(a[i],a[i+1])>min(a[i],a[i+1])*2){
            LL t1=max(a[i],a[i+1]);LL t2=min(a[i],a[i+1]);
            LL ans=0;
            while(t2*2<t1){ans++;t2*=2;}
            sum+=ans;
        }
    }
    cout<<sum<<"\n";
  }
return 0;
}
